Conjugacy and factorization results on matrix groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum conjugacy classes of simple matrix groups

Let G be a simple complex classical group and g its Lie algebra. Let U~(g) be the Drinfeld-Jimbo quantization of the universal enveloping algebra U(g). We construct an explicit U~(g)-equivariant quantization of conjugacy classes of G with Levi subgroups as the stabilizers.

متن کامل

Computing Conjugacy Classes of Elements in Matrix Groups

This article describes a setup that – given a composition tree – provides functionality for calculation in finite matrix groups using the Trivial-Fitting approach that has been used successfully for permutation groups. It treats the composition tree as a black-box object. It thus is applicable to other classes of groups for which a composition tree can be obtained. As an example, we consider an...

متن کامل

Conjugacy in Thompson’s groups

We give a unified solution the conjugacy problem in Thompson’s groups F , V , and T using strand diagrams, a modification of tree diagrams. We then analyze the complexity of the resulting algorithms. Thompson’s group F is the group of all piecewise-linear homeomorphisms of the unit interval satisfying the following conditions: 1. Every slope is a power of two, and 2. Every breakpoint has dyadic...

متن کامل

Conjugacy in Reductive Groups

Let G be a reductive algebraic group and H be a connected semisimple subgroup of G. The dimension data consists of the collection { dimV H } with V H denoting the space of points in V fixed by H , and where (ρ, V ) runs through all representations of G. One may ask if the dimension data determine H up to conjugacy or at least isomorphism. In other words, If H and H ′ have the same dimension dat...

متن کامل

Note on Matrix Factorization

A large portion of Linear algebra (scientific computing) is devoted to accelerate computationally intensive operations through the deeper understanding on the structure of the matrix. While it is not extremely hard to obtain an analytical solutions for the problems of interest, often a large-size matrix or repetetive nature of the computations prohibit us from getting the actual solution in num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Banach Center Publications

سال: 1994

ISSN: 0137-6934,1730-6299

DOI: 10.4064/-30-1-203-221